Diversity Comparison of Pareto Front Approximations in Many-Objective Optimization
نویسندگان
چکیده
منابع مشابه
Impact of selection methods on the diversity of many-objective Pareto set approximations
Selection methods are a key component of all multi-objective and, consequently, many-objective optimisation evolutionary algorithms. They must perform two main tasks simultaneously. First of all, they must select individuals that are as close as possible to the Pareto optimal front (convergence). Second, but not less important, they must help the evolutionary approach to provide a diverse popul...
متن کاملAdaptive Formation of Pareto Front in Evolutionary Multi-objective Optimization
Optimization is an important concept in science and engineering. Traditionally, methods are developed for unconstrained and constrained single objective optimization tasks. However, with the increasing complexity of optimization problems in the modern technological real world problems, multi-objective optimization algorithms are needed and being developed. With the advent of evolutionary algori...
متن کاملA New Algorithm for Constructing the Pareto Front of Bi-objective Optimization Problems
Here, scalarization techniques for multi-objective optimization problems are addressed. A new scalarization approach, called unified Pascoletti-Serafini approach, is utilized and a new algorithm to construct the Pareto front of a given bi-objective optimization problem is formulated. It is shown that we can restrict the parameters of the scalarized problem. The computed efficient points provide...
متن کاملEquispaced Pareto front construction for constrained bi-objective optimization
We consider constrained biobjective optimization problems. One of the extant issues in this area is that of uniform sampling of the Pareto front. We utilize equispacing constraints on the vector of objective values, as discussed in a previous paper dealing with the unconstrained problem. We present a direct and a dual formulation based on arc-length homotopy continuation and illustrate the dire...
متن کاملMany-Objective Pareto Local Search
We propose a new Pareto Local Search Algorithm for the many-objective combinatorial optimization. Pareto Local Search proved to be a very effective tool in the case of the bi-objective combinatorial optimization and it was used in a number of the state-of-the-art algorithms for problems of this kind. On the other hand, the standard Pareto Local Search algorithm becomes very inefficient for prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Cybernetics
سال: 2014
ISSN: 2168-2267,2168-2275
DOI: 10.1109/tcyb.2014.2310651